Implementing Language-Dependent Lexicographic Orders in Scheme
نویسنده
چکیده
The lexicographical order relations used within dictionaries are language-dependent, and we explain how we implemented such orders in Scheme. We show how our sorting orders are derived from the Unicode collation algorithm. Since the result of a Scheme function can be itself a function, we use generators of sorting orders. Specifying a sorting order for a new natural language has been made as easy as possible and can be done by a programmer who just has basic knowledge of Scheme. We also show how Scheme data structures allow our functions to be programmed efficiently.
منابع مشابه
Recursively Deened Quasi Orders on Terms
We study the problems involved in the recursive de nition of (quasi) orders on terms, focussing on the question of establishing well-de nedness, and the properties required for partial and quasi-orders: irre exivity and transitivity, and re exivity and transitivity, respectively. These properties are in general di cult to establish and this has in many cases come down in the literature as folkl...
متن کاملOn Lexicographic Probability Relations
In this note I examine conditions under which a probability relation on a set of events is lexicographic. Chipman (1971) discussed the question of the minimal ordinal CT such that there exists an order-preserving function from an ordered set A (in his; paper A is fR with any order on it) to lRa with the lexicographic order on it. Since there always exists an ordinal /? such that there is an ord...
متن کاملImplementing a Normalizer Using Sized Heterogeneous Types
In the simply-typed lambda-calculus, a hereditary substitution replaces a free variable in a normal form r by another normal form s of type a, removing freshly created redexes on the fly. It can be defined by lexicographic induction on a and r, thus, giving rise to a structurally recursive normalizer for the simply-typed lambda-calculus. We generalize this scheme to simultaneous substitutions, ...
متن کاملIterative Lexicographic Path Orders
We relate Kamin and Lévy’s original presentation of lexicographic path orders (LPO), using an inductive definition, to a presentation, which we will refer to as iterative lexicographic path orders (ILPO), based on Bergstra and Klop’s definition of recursive path orders by way of an auxiliary term rewriting sytem. Dedicated to Joseph Goguen, in celebration of his 65th birthday.
متن کاملA Local Version of Gotzmann's Persistence
Gotzmann's Persistence states that the growth of an arbitrary ideal can be controlled by comparing it to the growth of the lexicographic ideal. This is used, for instance, in finding equations which cut out the Hilbert scheme (of subschemes of P n with fixed Hilbert polynomial) sitting inside an appropriate Grassmannian. We introduce the notion of an ex-tremal ideal which extends the notion of ...
متن کامل